Method and apparatus for selecting image data to skip when encoding digital video

ABSTRACT

Block and frame skipping decides which image regions, blocks or frames in a video frame or series of frames should be encoded. Block skipping detects in advance which of the blocks in a video frame will produce little or no bits, so that the encoder can skip the encoding process for these blocks. Block skipping uses an iterative procedure to determine the optimal energy threshold value for each image frame. All the image blocks whose pixel energy is below the optimal threshold for the frame are skipped. Frame skipping predicts a distortion or image quality value for each frame. If some frames have a predicted image quality smaller than a preset value, these frames are allocated more bits and if, as a result, too few bits are left for future frames, the latter frames are skipped. This selective frame skipping guarantees that the quality of the non-skipped frames is above the preset value.

[0001] This application is a divisional of prior application Ser. Nos. 09/502,166, filed Feb. 11, 2000 and 09/502,167, filed Feb. 11, 2000, which are divisionals of prior application Ser. No. 09/052,882, filed Mar. 31, 1998, now abandoned.

BACKGROUND OF THE INVENTION

[0002] The invention relates to encoding digital images and video in low bit rate and low delay communication environments and more specifically to selecting which video frames and image regions should be skipped before encoding the digital images and video.

[0003] In low bit rate and low delay video communications, such as in a video phone, video conferencing, broadcast, etc., a large percentage of the video data cannot be encoded and transmitted to the receiver. In fact, entire video frames or large regions of pixels within a frame must often be skipped (not encoded) when the bit rate of the communication is too low or when the encoder buffer is approaching overflow. If the data to be skipped is not selected intelligently, the quality of the encoded video decreases dramatically.

[0004] Some compression techniques do not determine before hand that blocks are going to be skipped and as a result waste computation resources. At very low bit rates, the compression is so high that over 90 percent of the blocks may not produce any bits. Hence, these types of encoders waste time and computational resources by unnecessarily processing blocks that do not produce bits by the encoder. This waste is fairly dramatic in advanced video codecs, since block encoding usually requires complex transformation of the pixel values typically using a Discrete Cosine Transform (DCT) and some quantization of the transform coefficients.

[0005] Rate control methods generally use the energy of the pixels in a frame to determine bit allocations. The energy of the blocks that do not produce bits is also considered in the bit allocation. This procedure is not effective in intelligently distributing the bits throughout the frame and adversely affects the quality of the encoded image.

[0006] A system incorporating block skipping is described by A. Yu, R. Lee, and M. Flynn, “Early detection of all-zero coefficients in H.263”, in Proceedings of the Picture Coding Symposium, pp. 159-164, Berlin, September 97. In Yu, Lee, and Flynn, image blocks having DC coefficients below a threshold are skipped. This approach is simple to implement but skips important blocks that have high energy frequency components and a small DC value.

[0007] Another block skipping approach is described by A. Eleftheriadis and D. Anastassiou, “Constrained and general dynamic rate shaping of compressed digital video,” in Proceedings of the International Conference on Image Processing, vol. 3, pp. 396-399, October 95 and by R. J. Safranek, C. R. Kalmanek Jr., and R. Garg, “Methods for matching compressed video to ATM networks,” in Proceedings of the International Conference on Image Processing, vol. 1, pp. 13-16, October 95. This block skipping technique first encodes the image blocks and then drops encoded image blocks from the encoded bit stream to hit a target bit rate. The problem with this method is that all the blocks need to be encoded in advance and organized in order of importance. This technique defeats the purpose of saving computational complexity at the encoder.

[0008] In video communications, the encoding bits are usually stored in a buffer before they are transmitted through the channel. If there is high motion activity or a scene change, the video frames occupy many bits and the buffer fills up quickly. When the buffer is close to overflow, the encoder must produce fewer bits and even skip coding frames. Typically, during high motion and scene changes, one or several frames are skipped and the remaining, non-skipped frames are encoded with low image quality.

[0009] A smart encoder should decide when and how many frames should be skipped, so that enough bits are left for encoding the non-skipped frames with good quality. Forcing the encoder to operate on a smaller range of quantization values can prevent the drop in image quality in the non-skipped frames during high motion and scene changes. However, the number of bits produced per frame can not be controlled using this technique and presents the serious danger of buffer overflow. Some recent encoding techniques detect scene changes using ad hoc mechanisms and improve the image quality during the changes, but these methods are not robust and the video quality still drops occasionally. For example, U.S. Pat. No. 4,999,074 issued Mar. 12, 1991 to Ando entitled “System for efficiently coding a moving-picture signal, capable of selecting several different coding systems,” and U.S. Pat. No. 5,099,322 issued Mar. 24, 1994 to R. J. Gove, entitled “Scene change detection system and method” use simple frame difference and threshold-based mechanisms to detect the scene changes. The thresholds in these techniques are heuristically determined and easily fail.

[0010] Thus, a need remains for intelligently deciding which blocks in a video frame and which video frames should be skipped, when there is a limited number of available bits.

SUMMARY OF THE INVENTION

[0011] A block and frame skipping technique decides which image regions, blocks or frames in a video frame or series of frames should be skipped. Many of the blocks in a given video frame are very similar to blocks in previous frames and after motion compensation the pixel energy remaining in the blocks is very small. As a result, either few or no bits are generated when encoding these low energy blocks. Block skipping detects in advance which of the regions in a video frame will not produce any bits, so that the encoder can skip the encoding process for these blocks.

[0012] The energy threshold is dynamically adapted for every image frame according to the energy in the frame, a number of bits available for encoding the frame and the efficiency of the encoder. The block skipping technique uses an iterative procedure to determine the optimal energy threshold. Block skipping repeatedly discards the image block with the lowest energy and then recomputes the energy threshold. The process is repeated until the energy threshold is less than that of the block with lowest energy among the remaining nondiscarded blocks. The threshold at this point is referred to as the optimal energy threshold. All image blocks whose pixel energy is below the optimal energy threshold are skipped.

[0013] Frame skipping predicts the distortion quality of an entire frame before encoding. If the predicted frame quality is below a distortion threshold, more bits are assigned to that frame while other frames are skipped.

[0014] Block skipping and frame skipping provide more efficient bit rate control by not allocating bits to blocks or frames that should not be encoded. Block and frame skipping reduce up to 90 percent of the computational complexity of the DCT/quantization procedure at the encoder.

[0015] Another benefit of the invention from previous decoding techniques is that the quality of the encoded video is guaranteed not to drop below a minimum pixel signal to noise ratio (PSNR), even throughout scene changes and high-motion video frames. The number of bits produced per frame is well controlled and hence there is no danger of buffer overflow. Sophisticated scene change detectors or other complexity indicators are not required providing a computationally simple encoding technique. A typical block-based image coder is used to explain the invention. However, the block and frame skipping technique can be used for any image or video encoder.

[0016] The foregoing and other objects, features and advantages of the invention will become more readily apparent from the following detailed description of a preferred embodiment of the invention, which proceeds with reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0017]FIG. 1 is a block diagram of a prior art encoder.

[0018]FIG. 2 is a graph showing distortion for an image block.

[0019]FIG. 3 is a graph showing bits produced for the image block with block skipping.

[0020]FIG. 4 is a step diagram showing how block skipping is performed according to one aspect of the invention.

[0021]FIG. 5 is a block diagram showing how block skipping is incorporated into the encoder shown in FIG. 1.

[0022]FIG. 6 is a graph showing how block skipping is performed.

[0023]FIG. 7 is a graph showing how block skipping is performed using a low complexity technique.

[0024]FIG. 8 is a diagram showing how block skipping tags blocks under an optimum energy threshold.

[0025]FIG. 9 is a step diagram showing how frame skipping is performed according to another aspect of the invention.

[0026]FIG. 10 is a block diagram showing an encoder using both block and frame skipping.

[0027]FIG. 11 is a table showing the results of block skipping.

[0028]FIG. 12 is a graph showing the results of block skipping.

DETAILED DESCRIPTION

[0029] Referring to FIG. 1, a prior art encoder 12 encodes an ith block 14 of an image frame 11. In block-based image coding, the image frame 11 to be encoded is decomposed into multiple image blocks 14 of the same size, typically of 16×16 pixels per block 14. The pixel values of the block 14 are transformed in transform 16 into a set of coefficients, for example using a Discrete Cosine Transform (DCT). The coefficients output from transform 16 are quantized in quantizer 18 according to a set of quantization values 22 and further encoded in coder 20.

[0030] The quantization of the transformed coefficients in block 18 is a key procedure since it determines the distortion quality with which the image block 14 will be encoded. The quantization of the ith block 14 is controlled by only one parameter, Q_(i) from quantizer values 22. In the H.261 and H.263 video coding standards, Q_(i) is known as the quantization step for the ith block 14 and its value corresponds to half the step size used for quantizing the transformed coefficients.

[0031] The affect of the quantization steps Q_(i) on the distortion in the coded image is modeled below. High distortion indicates low image quality and vice versa. For the distortion in the i-th image block 14, D_(i) is the mean squared error (MSE) between the pixel values in the i-th original block 14 and those in the previously encoded version of the block output as encoded bit stream 24 from coder 20. The distortion D_(i) increases with coarser quantization, i.e., larger Q_(i). The following approximate expression is derived for D_(i): $\begin{matrix} {D_{i} = \left\{ {{\begin{matrix} {\frac{Q_{i}^{2}}{12};} & {{Q_{i} \leq Q_{i}^{\prime}} = {\sqrt{12}\sigma_{i}}} \\ {\sigma_{i}^{2};} & {otherwise} \end{matrix} = {\min \left( {\frac{Q_{i}^{2}}{12},\sigma_{i}^{2}} \right)}},} \right.} & (1) \end{matrix}$

[0032] That is shown in FIG. 2. The distortion D_(i) increases with the square of Q_(i) up to a saturation point, Q′_(i)={square root}{square root over (12)}σ_(i), which is when D_(i) reaches the value of the block's pixel variance σ_(i) ². When the quantizer step Q_(i) is larger than Q′_(i), the block's distortion will be the same, even if the block is not encoded.

[0033] Averaging the encoding distortion for the N blocks 14 in the image 11, the overall distortion is obtained: $\begin{matrix} {D = {{\frac{1}{N}{\sum\limits_{i = 1}^{N}D_{i}}} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{\min \left( {\frac{Q_{i}^{2}}{12},\sigma_{i}^{2}} \right)}}}}} & (2) \end{matrix}$

[0034] At high bit rates, the Q_(i)'s are small enough that Q_(i)<Q′_(i) for all i, and hence equation (2) can be simplified to: $\begin{matrix} {D = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{\frac{Q_{i}^{2}}{12}.}}}} & (3) \end{matrix}$

[0035] The simpler distortion model in equation (3) is not correct at very low bit rates since Q_(i) is often larger than Q′_(i) or some blocks. Unfortunately, the model in equation (2) makes the mathematical optimizations very difficult because of the minimization operators. Thus, equation (3) is often used even for low bit rate applications. Equation (3) is used to model distortion for quantization schemes such as described in co-pending patent application Ser. No. 09/008,137 filed Jan. 16, 1998 entitled “Method and Apparatus for Optimizing Quantizer Values in an Image Encoder”, that is herein incorporated by reference. In the co-pending application, the complete distortion model in equation (2) is incorporated into the rate-distortion optimization model and is the basis of the block and frame skipping according to the invention.

[0036] Intuitively, the number of bits B_(i) needed to encode the image blocks 14 increases with finer quantization (smaller Q_(i)). This relationship is modeled with the following equation: $\begin{matrix} {{B_{i} = {A\left( {{K\quad \frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)}},} & (4) \end{matrix}$

[0037] Where, B_(i) is proportional to the inverse of the squared quantizer step size Q_(i). A is the number of pixels in a block (e.g., in MPEG and H.263, A=16² pixels), K and C are model parameters that are estimated during encoding, and σ_(i) is the empirical standard deviation of the pixels in the block, $\begin{matrix} {{\sigma_{i} = \sqrt{\frac{1}{A}{\sum\limits_{j = 1}^{A}\left( {{P_{i}(j)} - {\overset{\_}{P}}_{i}} \right)^{2}}}},} & (5) \end{matrix}$

[0038] Where P_(i)(j) is the value of the jth pixel in the ith block 14 and {overscore (P)}_(i) is the average of the pixel values in the block 14, $\begin{matrix} {{\overset{\_}{P}}_{i} = {\frac{1}{A}{\sum\limits_{j = 1}^{A}{{P_{i}(j)}.}}}} & (6) \end{matrix}$

[0039] For color images, the P_(i)(j)'s are the values of the luminance and chrominance components at the respective pixels. The model in equation (4) was derived using a rate-distortion analysis of the block's encoder shown in FIG. 1 and is the same used in the co-pending application Ser. No. 09/008,137.

[0040] N is the number of image blocks 14 in the image frame 11 (FIG. 1). Using equation (4), bits are added for all the blocks and obtain the following expression for the total number of bits B: $\begin{matrix} {B = {{B_{1} + B_{2} + B_{3} + \ldots + {B_{N}{\sum\limits_{i = 1}^{N}B_{i}}}} = {\sum\limits_{i = 1}^{N}{A\left( {{K\quad \frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)}}}} & (7) \end{matrix}$

[0041] Where B depends on the quantization parameters selected, Q₁, Q₂, . . . , Q_(N) the energies or variances of the blocks, σ₁ ², σ₂ ², . . . , σ_(N) ², the block size A (in pixels), and the model parameters K and C.

[0042] Modified Encoder Model for Block Skipping

[0043] As mentioned above, when one of the blocks 14 is quantized with a step size Q_(i) larger than Q′_(i)={square root}{square root over (12)}σ_(i), the distortion remains the same, even if the block is not encoded. The smart rate control technique used in the present invention takes advantage of this property and skips blocks whenever Q_(i)≧{square root}{square root over (12)}σ_(i). In that case, the model in equation (4) for the number of bits produced should be modified as follows: $\begin{matrix} {B_{i} = \left\{ {{\begin{matrix} {{A\left( {{K\quad \frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)},} & {Q_{i} < {\sqrt{12}\sigma_{i}}} \\ {0,} & {Q_{i} \geq {\sqrt{12}\sigma_{i}}} \end{matrix} = {{A\left( {{K\frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)}{H\left( {Q_{i} - {\sqrt{12}\sigma_{i}}} \right)}}},} \right.} & (8) \end{matrix}$

[0044] Where H(Q_(i)−{square root}{square root over (12)}σ_(i)) is a step function which is equal to 1 when Q_(i)<{square root}{square root over (12)}σ_(i) and 0 otherwise. The form of B_(i) is shown in FIG. 3. Finally, the total number of bits for the frame is: $\begin{matrix} {B = {{B_{1} + B_{2} + B_{3} + \ldots + B_{N}} = {{\sum\limits_{i = 1}^{N}B_{i}} = {\sum\limits_{i = 1}^{N}{{A\left( {{K\frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)}{{H\left( {Q_{i} - {\sqrt{12}\sigma_{i}}} \right)}.}}}}}} & (9) \end{matrix}$

[0045] In rate control, the objective is to spend a pre-selected number of bits B into N image blocks, so that the image distortion is as small as possible (i.e., the image quality is as high as possible). Mathematically, this is equivalent to minimizing the distortion D in equation (2) subject to the constraint that the total number of bits must be equal to B in equation (9): $\begin{matrix} {{\overset{\sim}{D} = {{\min\limits_{Q_{1},\ldots,Q_{N}}D} = {\min\limits_{Q_{1},\ldots,Q_{N}}{\frac{1}{N}{\sum\limits_{i = 1}^{N}{\min \left( {\frac{Q_{i}^{2}}{12},\sigma_{i}^{2}} \right)}}}}}},{{{subject}\quad {to}\quad B} = {\sum\limits_{i = 1}^{N}{{A\left( {{K\frac{\sigma_{i}^{2}}{Q_{i}^{2}}} + C} \right)}{{H\left( {Q_{i} - {\sqrt{12}\sigma_{i}}} \right)}.}}}}} & (10) \end{matrix}$

[0046] The minimization in equation (10) is very difficult to solve mathematically because D is not convex or differentiable. The optimal Q′_(i) s are determined using a numerical optimization, but such techniques are complex since the number of variables to optimize, N, is usually very large. Alternatively, equation (10) is transformed into an approximate, simpler optimization problem.

[0047] Observe that if a set of values {circumflex over (Q)}₁, {circumflex over (Q)}₂, . . . , {circumflex over (Q)}_(N), minimize the distortion D and some {circumflex over (Q)}_(i) is larger than Q′_(i), the values are set as {circumflex over (Q)}₁=Q′_(i) without increasing the distortion. This is because D does not increase if some Q_(i) are larger than Q′_(i) (recall FIG. 2). Therefore, consider the following minimization: $\begin{matrix} {{D^{\prime} = {{\min\limits_{Q_{1,{.\ldots},}Q_{N}}{\frac{1}{N}{\sum\limits_{i = 1}^{N}D_{i}}}} = {\min\limits_{Q_{1,{.\ldots},}Q_{N}}{\frac{1}{N}{\sum\limits_{i = 1}^{N}\frac{Q_{i}^{2}}{12}}}}}},{{{subject}\quad {to}\quad B} = {\sum\limits_{i = 1}^{N}{{A\left( {K + \frac{\sigma_{i}^{2}}{Q_{i}^{2}} + C} \right)}\quad {and}\quad {\left\{ {{{Q_{i} \leq {\sqrt{12}{\sigma_{i}:\quad i}}} = 1},\quad \ldots \quad,N} \right\}.}}}}} & (11) \end{matrix}$

[0048] The solution of the minimization in equation (11) is very close to that in equation (10). Specifically, it is shown that {tilde over (D)}=D′ when B₀=AK/12+AC=0. B₀ is the minimum number of bits produced if a block is encoded (as shown in FIG. 3) and is not zero, but is typically very small. Focusing on finding a solution for equation (11), the relationship in equation (4) is used between B_(i) and Q_(i) to state the minimization as a function of the B_(i)'s, the number of bits allocated to the blocks: $\begin{matrix} {D^{\prime} = {{\underset{{B_{i} \geq B_{0}};{B = {\sum\limits_{i = 1}^{N}B_{i}}}}{\min\limits_{B_{1},\ldots,{B_{N}:}}}{\frac{1}{N}{\sum\limits_{i = 1}^{N}{D_{i}\left( B_{i} \right)}}}} = {\frac{1}{N}{\sum\limits_{i = 1}^{N}{\frac{AK}{12}{\frac{\sigma_{i}^{2}}{B_{i}}.}}}}}} & (12) \end{matrix}$

[0049] The formula for distortion in equation (12) is convex and is minimized over a convex set. Hence, there exist a unique set of values B*₁, . . . , B*_(N) that achieves the minimum. Furthermore, the Kuhn-Tucker theory indicates there exist some value L such that: $\begin{matrix} {{\frac{{D_{i}\left( B_{i}^{*} \right)}}{B_{i}} = {{L\quad {when}\quad B_{i}^{*}} > B_{0}}}{{\frac{{D_{i}\left( B_{i}^{*} \right)}}{B_{i}} \geq {L\quad {when}\quad B_{i}^{*}}} = {B_{0} \approx 0}}} & (13) \end{matrix}$

[0050] Using equation (13) and re-labeling the block variances (without loss of generality) so that σ₁≦σ₂≦ . . . ≦σ_(N) is it shown that there exist some value M such that:

B*_(i)=B₀≈0, i=1, 2, . . . , M

B*_(i)>B₀≈0, i=M+1, M+2, . . . , N  (14)

[0051] The conclusion in equation (14) is key to block skipping and indicates that, in order to minimize the MSE distortion, the M image blocks with smallest variance should have approximately zero bits, i.e., they should not be encoded.

[0052] The last step is to find the M blocks that need to be skipped. At this time, it is only known that blocks to be skipped have lower block energy than those blocks that will eventually be encoded. An expression for the value of L in equation (13) is obtained in equation (15). $\begin{matrix} {L = {{- \frac{1}{12}}\frac{AK}{\left( {B - {MB}_{0}} \right)^{2}}{\left( {\sum\limits_{k = {M + 1}}^{N}\sigma_{k}} \right)^{2}.}}} & (15) \end{matrix}$

[0053] Block and Frame Skipping

[0054] Combining equation (15) and equation (13), the following constraint is derived for the standard deviations of the M blocks that can be skipped: $\begin{matrix} {{{\sigma_{i} \leq T} = {\frac{1}{12}\frac{AK}{B - {MB}_{0}}{\sum\limits_{k = {M + 1}}^{N}\sigma_{k}}}},{{{for}\quad i} = 1},2,\quad \ldots \quad,M} & (16) \end{matrix}$

[0055] Equation (16) is the key for block skipping. The procedure determines the value of the threshold T before encoding the image blocks. All the blocks whose energy (in terms of standard deviation) is below T are skipped.

[0056] However, the value of T cannot be derived directly from equation (16), because T is a function of M, the number of blocks skipped. Hence T is needed to find the number of blocks to skip, M, and M is needed to find T. Using an iterative block skipping procedure as follows solves this conflict:

[0057] 1. Let m=1.

[0058] 2. Compute the value of equation T in equation (16) assuming that M=m−1.

[0059] 3. If σ_(M+1)<T, then M must be larger. Set m=m+1 and go back to 1.

[0060] Otherwise, the right values of T and M are found (stop).

[0061] Two methods are described below that implement this three-step procedure. One of the methods is essentially the same as described above. The procedure above assumes that the image blocks 14 have been ordered according to their standard deviation. The second procedure avoids the computational complexity associated with ordering the blocks by using a histogram of the standard deviations.

[0062] If M blocks with energy lower than the threshold T are skipped, the following formula is used to predict the optimal MSE distortion D′ for encoding the frame: $\begin{matrix} {{D^{\prime} = {{\frac{1}{N}{\sum\limits_{\sigma_{i} \leq T}^{\quad}\sigma_{i}^{2}}} + {\frac{AK}{12{N\left( {B - {ANC}} \right)}}\left( {\sum\limits_{\sigma_{i} > T}\sigma_{i}} \right)^{2}}}},} & (17) \end{matrix}$

[0063] Which is derived from minimizing equation (12). The formula for distortion in equation (17) is used to predict the value of the distortion with which a frame will be encoded. D′ can be expressed in pixel signal to noise ratio (PSNR) units as follows: $\begin{matrix} {D_{PSNR}^{\prime} = {10\log \quad \frac{255^{2}}{D}}} & (18) \end{matrix}$

[0064] If D_(PSNR) is smaller than some minimum PSNR quality (set by the user), the number of bits B is increased for the current frame and future frames are skipped accordingly.

[0065]FIGS. 4 and 5 show how block skipping is performed according to the invention. FIG. 5 shows block skipping 13 included in the encoder 12 previously described in FIG. 1. A step diagram in FIG. 4 describes the operations performed by the block skipping function 13.

[0066] Step 1: Initialization

[0067] A frame 11 is decomposed into N blocks 14 of a fixed size, e.g., 16×16 pixels per block in step 30. The standard deviations σ₁, σ₂, . . . , σ_(N) of the pixels (energy) in the blocks 14 are derived in step 32 using the formula in equation (3). The standard deviations are ordered (ranked) according to energy values in step 34. Let σ_(m) ₁ , σ_(m) ₂ , . . . , σ_(m) _(N) be the ordered standard deviations of the blocks 14, where m_(i) corresponds to the index of the block with the m_(i)-th smallest standard deviation. For example, m₂=5 means that the 5-th image block (in a raster-scan order) has the second smallest standard deviation. At the beginning, no block is discarded and we set j=1. An initial block-skipping threshold is computed for all the blocks in step 38 according to the following equation: ${T = {\frac{1}{12}\frac{AK}{B}{\sum\limits_{i = 1}^{N}\sigma_{m_{i}}}}},$

[0068] Where A, K, and B are the number of bits in block 14, a parameter of the encoder (typically set K=1), and the number of bits available for encoding the frame 11, respectively.

[0069] Step 2: Check threshold condition

[0070] If the energy of the block with lowest energy among the non-discarded blocks is larger than the threshold value T in decision step 40, the process jumps to Step 3. Otherwise, the block skipping operation jumps to step 36, the latter lowest energy block is discarded in step 36, and the threshold value T is recomputed for the remaining nondiscarded blocks in step 38 as follows: ${T = {\frac{1}{12}\frac{AK}{B}{\sum\limits_{i = {j + 1}}^{N}\sigma_{m_{i}}}}},$

[0071] Then we set j=j+1 and go back to Step 2.

[0072] Step 3: End

[0073] When the energy of the lowest energy block is greater than the threshold value T (i.e., the energy intersects T), then no additional blocks 14 are discarded from the frame 11. The remaining blocks 15 (FIG. 5) are encoded in step 42 by block transform 16 (FIG. 5), such as with a DCT. Block quantizer 18 quantizes the transform coefficients before being coded as a B_(i) bit stream by coder 20. After all the blocks 15 are encoded, step 44 gets the next frame 11 and returns to step 30.

[0074] Block skipping is shown graphically in FIG. 6. Assume, without loss of generality, that σ₁≦σ₂≦ . . . ≦σ_(N). A first threshold value T₁ is generated using the standard deviations from blocks σ₁, σ₂, . . . , σ_(N). Since σ₁ is less than T₁, the block associated with σ₁ is discarded and the threshold recalculated (T₂) with σ₂, σ₃, . . . , σ_(N). In the example shown in FIG. 6, σ₂ is less than T₂ and so the next threshold T₃ is calculated using only σ₃, σ₄, . . . , σ_(N), and so on. Because σ₄ is greater than T₄, the threshold is set at T₄ and the three blocks with lowest standard deviations σ₁, σ₂, σ₃ are discarded and not encoded. Calculating bit allocation only with the remaining blocks increases the quality in the encoded image by not pre-allocating bits to blocks that will be discarded.

[0075] Low Complexity Implementation

[0076] For some real-time video codecs, the procedure above is too complex. In fact, many codecs decompose images into several hundred blocks before encoding. Hence, ordering these blocks 14 according to their standard deviation is computationally expensive. The following low-complexity implementation approximates the ranking step performed above. The key in this implementation is that block ordering is not needed, because a histogram of the block variances is generated during the computation of the standard deviations.

[0077] Step 1. Initialization

[0078] The standard deviations and the histogram for each block 14 are computed. Let Δ be the resolution of the histogram H(index).

[0079] Let i=1, S=0, and H(index)=0 for all index.

[0080] 1. The standard deviation for i-th block σ_(i), is computed as described above in equation 3.

[0081] 2. The histogram index is computed for that σ_(i): ${{index} = {{int}\left( \frac{\sigma_{i}}{\Delta} \right)}},$

[0082] Where int denotes integer part

[0083] 3. H(index)=H(index)+1

[0084] 4. The energy for the block is added to the total, S=S+index Δ≈S+σ_(i).

[0085] 5. Let i=i+1. If i>N, stop, otherwise go to 1.

[0086] Let j=1 and set the initial block skipping threshold to ${T = {\frac{1}{12}\frac{AK}{B}S}},$

[0087] Step 2. Check threshold condition

[0088] If(jΔ<T) $\begin{matrix} {S = {S - {j\quad \Delta \quad {H({index})}}}} \\ {T = {\frac{1}{12}\frac{AK}{B}S}} \\ {j = {j + 1}} \end{matrix}$

[0089] go to Step 2

[0090] If not, go to Step 3 and keep the final value of T

[0091] Step 3. End

[0092] The reduction technique is shown graphically in FIG. 7. The standard deviations for each block σ₁, σ₂, . . . , σ_(N) (ordered from smallest to largest) are placed in bins defined by the histogram resolution Δ. All standard deviations within a first integer multiple of the histogram resolution Δ are placed in a first H(1) histogram bin 46. All standard deviations for a second integer multiple of Δ are assigned to a second H(2) histogram bin 48, etc. The first threshold value T₁ is calculated with the standard deviations accumulated for all blocks 14. If the first threshold value T₁ is greater than the energy associated with the first histogram bin 46, all blocks placed in bin H(1) are discarded. A second threshold value T₂ is then calculated minus the value of the energy values of the first histogram range H(1). The process continues until the threshold value T is less than the smallest remaining histogram value. All blocks having standard deviations in one of the discarded histogram bins are discarded prior to block encoding. In FIG. 7, all blocks having energies in histogram bins H(1) and H(2) are discarded.

[0093] The value of T can be directly used by the block-layer rate control technique described in the co-pending patent application Ser. No. 09/008,137 so that all the blocks with standard deviations lower than T are skipped. To do this, the image blocks 14 to be skipped are tagged as shown with an “x” as shown in FIG. 8. The blocks 50 with energy lower than T are marked with “x” and are skipped during the subsequent encoding process. In video sequences, these blocks typically belong to regions that do not move between frames, e.g., the blocks in a static background. This can be implemented using a bit map that has one bit associated with each block in the frame 11. The bits in the bit map associated with the discarded blocks 50 are set to 1. When rate control is used, the tagged blocks are ignored and only the energy of the remaining blocks is taken into account for the bit allocation.

[0094] Frame Skipping

[0095]FIG. 9 shows how frame skipping is performed.

[0096] Step 1. Predict Distortion

[0097] The distortion or, equivalently, the image quality for the current frame D_(PSNR) is predicted in step 52 using the equation (17) and (18) derived above: ${D = {{\frac{1}{N}{\sum\limits_{\sigma_{i} \leq T}\sigma_{i}^{2}}} + {\frac{AK}{12{N\left( {B - {ANC}} \right)}}\left( {\sum\limits_{\sigma_{i} > T}\sigma_{i}} \right)^{2}}}},{D_{PSNR} = {10\log \frac{255^{2}}{D}}},$

[0098] Where the parameters A, K, N, B, T, and {σ_(i)} have already been defined, and C models the expected rate in bits per pixel for encoding the codec syntax information. The syntax rate C for many codecs (e.g., MPEG, H.263, etc.) can be approximated by a linear formula:

C=an(T)+b,

[0099] Where n(T) is the number of blocks that will be skipped in the frame (i.e., those whose standard deviation is lower than T), and a and b are two constants that depend on the type of codec. For an MPEG-4 codec, the values a=−0.00036 and b=0.04 are used.

[0100] The value of D above is the approximate mean squared error in the encoded (compressed) frame with respect to the original (uncompressed) frame. D_(PSNR) is the peak signal to noise ratio, which is a function of D. If an image is encoded with high quality, the distortion measure D is small and D_(PSNR) is large.

[0101] Step 2. Increase Frame Target

[0102] If the image quality, in terms of D_(PSNR), is less than a minimum preset value MIN in decision block 54,

(D_(PSNR)<MIN),

[0103] The number of bits is increased for the present frame in step 56, B=B+Inc. The encoder then goes back to Step 1 for “Block Skipping” to find the new value of T, since with the new frame target B, fewer blocks might be skipped.

[0104] A typical value of Inc is R/F, where R is the channel or target bit rate (in bits per second) and F is the frame rate of the video data (in frames per second). Any other value larger than zero could be used. For example, if the value B is determined in equation (17), the number of bits that would provide a good value of Inc is obtained: $\begin{matrix} {{{Inc} = {{ANC} + {\frac{AK}{12}\frac{\left( {\sum\limits_{\sigma_{i} > T}\sigma_{i}} \right)^{2}}{\frac{255^{2}}{10^{{MIN}/10}} - {\frac{1}{N}{\sum\limits_{\sigma_{i} > T}\sigma_{i}^{2}}}}} - B}},} & (19) \end{matrix}$

[0105] Which is the increase in bits needed to have D_(PSNR)=MIN. Equation (19) is obtained by combining equations (17) and (18), replacing B with Inc+B and D_(PSNR) with MIN in the combined equation, and isolating Inc. In tests, a value of MIN=27 dB was used, but any other value could be selected directly by the user. The user can select and modify the value of MIN during the video communication by simply turning a knob. This process guarantees that all video frames encoded will have a D_(PSNR) image quality larger than MIN.

[0106] Step 3. Skip Frame

[0107] The number of bits in the encoder buffer, W′, is estimated in step 60 after encoding the current frame with B bits:

W′=max(W+B−R/F,0),

[0108] Where W is the current number of bits in the buffer, B is the frame target and R/F is the number of bits accepted by the communication channel per frame interval.

[0109] The encoder skips encoding of as many frames as necessary to keep the number of bits in the buffer below some maximum, MAX, whose value depends on the buffer size. For example, if the buffer size is 20,000 bits, MAX is typically chosen to be a value between 16,000 and 18,000 bits, which corresponds to 80-90 percent of the buffer size. If decision step 62 determines that the number of bits in the encoder buffer is greater than MAX, the number of frames to skip, Num_skip, in order to keep the buffer level below MAX is determined in step 64 as follows:

[0110] If W′>MAX $\begin{matrix} {{Num\_ skip} = \left\lceil \frac{W^{\prime} - {MAX}}{R/F} \right\rceil} & (20) \end{matrix}$

[0111] Otherwise Num_skip=0.

[0112] In equation (20), the operation ┐a┌ consists of rounding a to the closest integer larger than a. Even before the current frame is encoded, the encoder knows that “Num_skip” frames will be skipped after the current frame to prevent buffer overflow. This information is useful since, the encoder may decide to slow down the encoding process for the current frame and maybe spend more time optimizing the bit allocation.

[0113]FIG. 10 shows the encoder 12 that incorporates both the block skipping shown in FIG. 4 and the frame skipping shown in FIG. 9. Digital video frames 11 are selected in frame selection 70. Block skipping 74 determines how many blocks in the current frame should be skipped to minimize image distortion. Frame skipping in block 76 allots more bits to frames having a D_(PSNR) quality below a preset quality (or distortion) threshold. If the current frame is below the distortion threshold and allotted more bits, the current frame is sent back to block skipping 74. The energy threshold is recalculated according to the new bit allotment. Frame skipping 76 then determines the number of subsequent frames that need to be skipped based on the new bit allotment for the current frame. The number of frames to be skipped is indicated to the frame selection 70. Accordingly, a number of blocks 14 in each frame 11 and a number of frames 11 in the sequence of frames 10 are skipped before any encoding is performed in encoder 78.

[0114] The block and frame skipping scheme was used to encode frames of real video sequences using an MPEG4 video codec (version VM 7.0). The video sequences, format, frame rate in frames per second (fps), and bit rate in Kilobits per second (Kbps) are described in the table shown in FIG. 11. Each video sequence had 300 frames. In FIG. 11, the increase in image quality is shown when the block skipping procedure is used in conjunction with the rate control defined in co-pending application Ser. No. 09/008,137. Quality improvements of up to 3.4 dB are achieved. Knowing which blocks will be skipped, increases image quality by allowing a more effective bit allocation.

[0115] Additionally, FIG. 11 indicates the (approximate) percentage of blocks that are skipped per frame, which translates directly into savings on computation since those blocks are not DCT transformed and quantized. This technique can save up to about 90% of processing required for performing the DCT/quantization operations.

[0116] The frame skipping technique guarantees a minimum PSNR quality per video frame, even throughout scene changes. Frames are skipped to maintain the image quality and not as a reaction to a panic situation, like when a buffer is close to overflow.

[0117] Results of the frame skipping mechanism (combined with block skipping) when encoding “Hall” at 10 Kbps and 10 frames per second (fps) is shown in FIG. 12. In FIG. 12, a solid line 80 indicates the PSNR of the coded frames in the well-known video sequence “Hall”, at 10 Kbps and 7.5 fps. A dashed line 82 is a prediction for the PSNR using the technique in equations (17) and (18). Block skipping prediction is very close to the actual PSNR, typically within 0.5 dB. A dotted line 84 is the minimum PSNR, which is set to MIN=27 dB. The PSNR of the sequence is maintained above the minimum.

[0118] Between frames 10 and 20 there is a significant change of image data, since a person that occupies a large percentage of the frame size suddenly appears in the scene. This phenomenon would not be detectable with prior art methods, because those methods detect only scene changes. Block and frame skipping predicts the drop in quality and skips several frames to maintain the PSNR above 27 dB. Without frame skipping, the image quality would have dropped close to 24 dB.

[0119] Variations of the block and frame skipping technique are described below, which are also based on a single-pass encoding framework. If the computation of the σ_(k)'s used for finding S cannot be done in advance, a good estimate for the total energy in the frame S is used such as the value of S from the previous video frame.

[0120] In order to further reduce the computational complexity, the formula for the standard deviation in equation (5) is replaced by ${\sigma_{i} = {\frac{1}{A}{\sum\limits_{j = 1}^{A}\quad {{abs}\left( {{P_{i}(j)} - {\overset{\_}{P}}_{i}} \right)}}}},$

[0121] Where abs(x) is the absolute value of x. In video coding, the mean value of pixels in inter blocks is usually zero and hence this formula may be simplified by setting {overscore (P)}_(i)=0.

[0122] All or any subset of the techniques above can be combined and used together. The systems for block and frame skipping can be incorporated as a middle layer between the classical frame and block (or macroblock) layers in video codecs as shown in FIG. 10. Block skipping can be done before frame skipping to improve the prediction of the encoding quality and hence both methods complement each other, but these techniques can also be used separately and with any rate control technique.

[0123] The theory underlying the derivation of the techniques disclosed here is also used in the frame-layer and block-layer techniques disclosed in the co-pending patent application Ser. No. 09/008,137. Several of the parameters described here are also used in the other methods disclosed in this co-pending application and hence a combination of all the methods would further reduce encoding computational complexity.

[0124] Block and frame skipping can be used for encoding digital images and video in low-delay communications (e.g., video phone, video conferencing, broadcast, etc.), especially through low bit rate communication channels (e.g., PSTN, ISDN, mobile channels, etc.) The invention can also be used with any video encoder, including those compliant with the standards MPEG 1-2-4, H.261, H.263 and H.263+.

[0125] Having described and illustrated the principles of the invention in a preferred embodiment thereof, it should be apparent that the invention can be modified in arrangement and detail without departing from such principles. I claim all modifications and variations coming with the spirit and scope of the following claims. 

1. A method for encoding images, comprising: decomposing images into multiple image subsections; deriving the energy for the individual image subsections; dynamically deriving an energy threshold individually adapted to every image according to the energy of the image subsections, a number of bits available for encoding the image, and a coding efficiency of an image encoder; and selecting image subsections in each image for encoding according to the individually adapted energy threshold; and encoding the selected image subsections for each image while discarding nonselected image subsections.
 2. A method according to claim 1 wherein deriving the energy thresholds for each image includes repeatedly discarding one or more of the multiple image subsections with a lowest energy and computing another threshold using only the remaining nondiscarded image subsections until one or more of the remaining lowest energy image subsections is greater than the computed energy threshold.
 3. A method according to claim 1 wherein the energy threshold is derived according to a total energy for all the selected nondiscarded image subsections and a number of bits available for encoding the selected nondiscarded image subsections.
 4. A method according to claim 3 wherein the energy threshold is derived according to the following: ${T = {\frac{1}{12}\frac{AK}{B}{\sum\limits_{m = {M + 1}}^{N}\quad \sigma_{m_{i}}}}},$

Where A is a number of pixels in each image subsection, K is a constant parameter, B is a number of bits available for encoding the image, σ_(K) _(i) is a standard deviation of pixels values in image subsections and M is the number of discarded image subsections.
 5. A method according to claim 1 including ranking the image subsections according to the amount of energy and discarding the image subsections starting with one of the image subsections with a lowest energy.
 6. A method according to claim 1 including: computing a standard deviation σ_(i) for each one of the image subsections; computing histogram indices for the standard deviations σ_(i); calculating the energy threshold for all image subsections; discarding all image subsections with a smallest histogram index when the energy associated to the lowest histogram index is less than the energy threshold; and repeatedly recalculating the energy threshold only with the nondiscarded image subsections and discarding all image subsections in the lowest nondiscarded histogram index until the energy associated to the lowest nondiscarded histogram index is greater than the energy threshold.
 7. A method according to claim 1 including; decomposing the image includes multiple frames each decomposed into multiple blocks; allotting a given bit rate for encoding the multiple frames; predicting a distortion or quality value for each one of the frames which depends on the energy thresholds adapted to the respective frames; setting a minimum frame quality value; and allotting more bits to frames that have a predicted quality values lower than the minimum frame quality value and discarding other frames until the quality of the nondiscarded frames is above the minimum frame quality value.
 8. A method according to claim 7 including: predicting the distortion value for each frame according to the following: ${D_{PSNR} = {10\quad \log_{10}\frac{255^{2}}{D}}},{{{with}\quad D} = {{\frac{1}{N}{\sum\limits_{\sigma_{i} \leq T}\sigma_{i}^{2}}} + {\frac{AK}{12{N\left( {B - {ANC}} \right)}}\left( {\sum\limits_{\sigma_{i} > T}\sigma_{i}} \right)^{2}}}},$

Where A is a number of pixels in each block, K and C are constant parameters of the encoder, B is the number of bits for the bit rate available for encoding the image, σ_(i) is a standard deviation of pixels values for block i, T is the energy threshold, and N is the number of blocks in the frame.
 9. A method according to claim 7 including: allotting an increased number of bits B=B+Inc for the frames having quality values smaller than the minimum frame quality value where ${{Inc} = {{ANC} + {\frac{AK}{12}\frac{\left( {\sum\limits_{\sigma_{i} > T}\sigma_{i}} \right)^{2}}{\frac{255^{2}}{10^{{MIN}/10}} - {\frac{1}{N}{\sum\limits_{\sigma_{i} > T}\sigma_{i}^{2}}}}} - B}},$

and MIN is a user selectable minimum frame quality value.
 10. A method according to claim 7 including the following: estimating a number of bits in an encoder buffer W′ after encoding a current frame according to the current number of bits in the buffer, the target number of bits for encoding the current frame and the number of bits accepted by the communication channel per frame interval; and, skipping a number of frames when the estimated number of bits is greater than a preselected bit overflow threshold number for the buffer.
 11. A method according to claim 1 including the following: calculating the energy for the individual image subsections as a standard deviation for the pixels in each image derived according to a number of pixels in the image subsection, pixel values in the ith image subsection and an average of the pixel values in the image subsection.
 12. A method according to claim 11 including deriving the standard deviations of the pixel values from a previous image frame.
 13. A method according to claim 11 including estimating the standard deviation for each image subsection according to the absolute value of the pixel values in the image subsection and the average pixel value in the image subsection.
 14. A method according to claim 11 including simplifying the energy calculation for the image subsections by setting the average pixel value to zero. 